Binary Pseudorandom Sequences of Period 2/sup m/-1 with Ideal Autocorrelation Generated by the Polyn - Information Theory, IEEE Transactions on
نویسندگان
چکیده
In this correspondence, we present a construction for binary pseudorandom sequences of period 2 1 with ideal autocorrelation property using the polynomial z+(z+1). We show that the sequence obtained from the polynomial becomes an m-sequence for certain values of d. We also find a few values of d which yield new binary sequences with ideal autocorrelation property when m is 3k 1, where k is a positive integer. These new sequences are represented using trace function and the results are tabulated.
منابع مشابه
Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation
In this correspondence, we present five new classes of binary sequences of period 2 1 with ideal autocorrelation. These sequences, which correspond to new cyclic Hadamard difference sets, were found by extensive computer search. Conjectures on the general construction of these sequences are formulated.
متن کاملA class of pseudonoise sequences over GF(P) with low correlation zone
b = 1. The index set I must be of the form I = A [ B [ C where A = f1g B = fz + 1 j z 2 C0; z + 1 2 C0g and C = f0z j z 2 C1; z + 1 2 C1g: Observe that these three sets are pairwise-disjoint. Therefore, The other cases can be treated similarly. ACKNOWLEDGMENT The authors wish to thank the anonymous referee for careful review of the original manuscript and helpful comments. Double-check of the c...
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملCryptographic properties of the Welch-Gong transformation sequence generators
Welch–Gong (WG) transformation sequences are binary sequences of period 2 1 with two-level autocorrelation. These sequences were discovered by Golomb, Gong, and Gaal in 1998 and they verified the validity of their construction for 5 20. Later, No, Chung, and Yun found another way to construct the WG sequences and verified their result for 5 23. Dillon first proved this result for odd in 1998, a...
متن کاملPartial period autocorrelations of geometric sequences
For a binary pseudorandom sequence {Si} with period N , the partial period autocorrelation function AS(τ, k,D) is defined by correlating the portion of the sequence within a window of size D, and start position k, with the portion in another window of the same size but starting τ steps later in the sequence. A distribution of possible partial period autocorrelation values is obtained by allowin...
متن کامل